An Optimal Voting System When Voting is Costly∗

نویسندگان

  • Katalin Bognar
  • Tilman Börgers
  • Moritz Meyer-ter-Vehn
چکیده

We consider the design of an optimal voting system when voting is costly. For a private values model with two alternatives we show the optimality of a voting system that combines three elements: (i) there is an arbitrarily chosen default decision and non-participation is interpreted as a vote in favor of the default; (ii) voting is sequential; (iii) not all voters are invited to participate in the vote. We show the optimality of such a voting system by first arguing that it is first best, that is, it maximizes welfare when incentive compatibility constraints are ignored, and then showing that individual incentives and social welfare are sufficiently aligned to make the first best system incentive compatible. The analysis in this paper involves some methods that are new to the theory of mechanism design, and it is also a purpose of this paper to explore these new methods. ∗This paper supersedes a previous draft entitled “Dynamic Mechanism Design with Costly Participation.” We are grateful to Alessandro Pavan, Marek Pycia, Ilya Segal, and Ricky Vohra for helpful comments. Tilman Börgers thanks the Center for Mathematical Studies in Economics and Management Science at Northwestern University for the hospitality that it offered while he was working on this paper. Moritz Meyer-ter-Vehn thanks the Hausdorff Research Institute for Mathematics in Bonn for its hospitality, which he enjoyed while working on this paper. †Department of Economics, UCLA, [email protected]. ‡Department of Economics, University of Michigan, [email protected]. §Department of Economics, UCLA, [email protected].

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Voting Algorithm Based on Adaptive Neuro Fuzzy Inference System for Fault Tolerant Systems

some applications are critical and must designed Fault Tolerant System. Usually Voting Algorithm is one of the principle elements of a Fault Tolerant System. Two kinds of voting algorithm are used in most applications, they are majority voting algorithm and weighted average algorithm these algorithms have some problems. Majority confronts with the problem of threshold limits and voter of weight...

متن کامل

Voting Algorithm Based on Adaptive Neuro Fuzzy Inference System for Fault Tolerant Systems

some applications are critical and must designed Fault Tolerant System. Usually Voting Algorithm is one of the principle elements of a Fault Tolerant System. Two kinds of voting algorithm are used in most applications, they are majority voting algorithm and weighted average algorithm these algorithms have some problems. Majority confronts with the problem of threshold limits and voter of weight...

متن کامل

An Optimal Voting System When Voting is Costly - A Case Study in Dynamic Mechanism Design

We propose a formulation for the problem of designing an optimal dynamic voting system when voting is costly. The possibility to coordinate participation by voting sequentially requires explicit maximization over a set of dynamic mechanisms which involves some arguments that are new to the theory of mechanism design. For a highly stylized specification of our model with private values and two a...

متن کامل

An improved approach for ranking the candidates in a voting system based on efficiency intervals

This paper proposes improvements and revisions to a recent approach in a voting system, and provides an effective approach with a stronger discriminate power. For this purpose, the advantage of a linear transformation is utilized to redene a previously used concept of virtual worst candidate, by incorporating the existing weight restrictions. Then, the best score of this virtual candidate is us...

متن کامل

An Effective and Optimal Fusion Rule in the Presence of Probabilistic Spectrum Sensing Data Falsification Attack

Cognitive radio (CR) network is an excellent solution to the spectrum scarcity problem. Cooperative spectrum sensing (CSS) has been widely used to precisely detect of primary user (PU) signals. The trustworthiness of the CSS is vulnerable to spectrum sensing data falsification (SSDF) attack. In an SSDF attack, some malicious users intentionally report wrong sensing results to cheat the fusion c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010